搜索资源列表
yunchou
- 利用单纯形法解决线性规划问题，是利用c++实现的。。希望能对大家有所帮助 -Use simplex method to solve linear programming problems is to use c++ implementation. . Hope you can help
1
- 单纯形法，可在C++环境下运行，可用于线性规划问题的求解-Simplex method can be run under C++ environment can be used for solving linear programming problems
simplex
- 用单纯形法中的人工变量法求解线性规划问题，C语言实现-Simplex method of artificial variables for solving linear programming, C language
MyClass
- 线性规划单纯形法的简单c++实现。可以解较为简单的线性规划方程。-This is about simplex-method of linear-program.It is simply to solve the linear programming equation.
originalsimple
- 原始单纯形法（需直接给出初始的基变量） 求解标准型线性规划:max C*X s.t. A*X=b (b>=0) X>=0 输入：C是n维行向量，A是m*n的系数矩阵，b是m维列向量，XB承装初始基变量的下标。输出：x最优解（如果有的话），fval最优值，flag解的状态说明，interation求解时的循环次数。-Original simplex method (to be given directly to the initial base variable) Solvin
cdcxf
- 单纯形法c++编程，以解决运筹学中线性规划问题，程序简单明了，对于初学者来说是一个很不错的选择-Simplex Method c programming, operations research to solve linear programming problems, procedures simple and clear, for a newcomer is a very bad choice
SimpleMthd
- 单纯形法matlab程序 求解标准型线性规划:max c*x s.t. A*x=b x>=0 本函数中的A是单纯初始表，包括:最后一行是初始的检验数，最后一列是资源向量b N是初始的基变量的下标 输出变量sol是最优解, 其中松弛变量（或剩余变量）可能不为0 输出变量val是最优目标值，kk是迭代次数- example：max 2*x1+3*x2 s.t. x1+2*x2<=8 4*x1<=16 4*x
Linear
- 对一定量的数据进行线性规划的对偶单纯形法用c语言实现-To a certain amount of data of the dual simplex method for linear programming with c language implementation
simplemethod
- c实现的单纯形法，求解线性规划问题的一种解法-c achieved simplex method for solving linear programming problems of a solution
simplex100
- 一个C#开发的线性规划 单纯形算法，能够求解中小规模的线性规划问题，欢迎大家下载，自己写的哦-A C# development of linear programming simplex algorithm to solve the small and medium-scale linear programming problem, welcome to download their own writing Oh! !
QALGFN7
- 单纯形法c++编程,可用于线性规划问题的研究解决优化问题-C++ programming, simplex method can be used in the study of linear programming to solve optimization problem
fuyd
- 求线性规划的“单纯形”法源程序,用C编写()
nodulh
- 用单纯形法解线性规划问题 C语言编写 C++环境开发()
nctfl
- 求线性规划的“单纯形”法源程序,用C编写()
181268
- 用单纯形法解线性规划问题 C语言编写 C++环境开发()